Optimal Interleaving on Tori

Optimal Interleaving on Tori

This paper studies t-interleaving on two-dimensional tori, which is defined by the property that every connected subgraph of order t in the torus is labelled by t distinct integers. This is the first time that the t-interleaving problem is solved for graphs of modular structures. t-interleaving on tori has applications in distributed data storage and burst error correction, and is closely relat...

Toward Optimal Complete Ex hange on Wormhole-Routed Tori

Toward Optimal Complete Exchange on Wormhole-Routed Tori

ÐIn this paper, we propose new routing schemes to perform all-to-all personalized communication (or known as complete exchange) in wormhole-routed, one-port tori. On tori of equal size along each dimension, our algorithms use both asymptotically optimal startup and transmission time. The results are characterized by several interesting features: 1) the use of gather-scatter tree to achieve opti...

Quasi-Optimal and Optimal Generalized Mutually Orthogonal ZCZ Sequence Sets Based on an Interleaving Technique

The present paper proposes methods for constructing quasi-optimal or optimal generalized mutually orthogonal zerocorrelation zone (GMO-ZCZ) sequence sets. Zero-correlation zone (ZCZ) sequence sets have been studied as spreading sequences for approximately synchronized code-division multiple-access (ASCDMA) systems. A mutually orthogonal ZCZ (MO-ZCZ) sequence set is composed of several small ZCZ...

Optimal 2-D Interleaving for Robust Multimedia Transmission

Interleaving is a process to rearrange code symbols so as to spread bursts of errors over multiple codewords that can be corrected by random error correction codes (ECCs). By converting bursts of errors into random-like errors, interleaving thus becomes an effective means to combat error bursts. In this paper, we focus on how to obtain effective interleaving schemes for 2-dimensional (2-D) arra...